Multi-Stage Facility Location Problems with Transient Agents

We study various models for the one-dimensional multi-stage facility location problems with transient agents, where a agent arrives in some stage and stays number of consecutive stages. In problems, we need to serve each one their stages by determining at stage. first model, assume there is no cost moving across focus on optimal algorithms minimize both social objective, defined as total distance all agents over stages, maximum max any For give slice-wise polynomial (XP) algorithm (i.e., solvable m^f(k) fixed parameter k computable function f, m input size) show that polynomial-time when natural first-come-first-serve (FCFS) order serving enforced. then consider mechanism design problem, agents' locations arrival are private, group strategy-proof achieves good approximation ratios objectives settings without FCFS ordering. second facility's between adjacent under which accounts facility. Correspondingly, XP (and time) or